Percolation in clustered networks
نویسنده
چکیده
The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied clustered networks, but the networks often contain preferential mixing between high degree nodes. We introduce a class of random clustered networks and another class of random unclustered networks with the same preferential mixing. We analytically show that percolation in the clustered networks reduces the component sizes and increases the epidemic threshold compared to the unclustered networks.
منابع مشابه
Percolation and epidemics in random clustered networks.
The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree n...
متن کاملPercolation and epidemic thresholds in clustered networks.
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks, thus e...
متن کاملSite percolation in clustered random networks
In [1] a model was introduced for the creation of a class of random networks with nonzero clustering. Within this model the degree distribution and clustering spectrum of a network are prescribed, and as such can be fitted to given real-world data. Here we present an analytical approach to site percolation in these networks. Theoretical predictions for the critical site occupation probability a...
متن کاملThe robustness of interdependent clustered networks
It was recently found that cascading failures can cause the abrupt breakdown of a system of interdependent networks. Using the percolation method developed for single clustered networks by Newman [Phys. Rev. Lett. 103, 058701 (2009)], we develop an analytical method for studying how clustering within the networks of a system of interdependent networks affects the system’s robustness. We find th...
متن کاملThe Unreasonable Effectiveness of Tree-Based Theory for Bond Percolation on Networks with Clustering
We demonstrate that a tree-based theory for bond percolation yields extremely accurate results for several networks with high levels of clustering. We find that such a theory works well as long as the mean intervertex distance l is sufficiently small—i.e., as long as it is close to the value of l in a random network with negligible clustering and the same degree-degree correlations. We confirm ...
متن کامل